Formulations for dynamic lot sizing with service levels
نویسندگان
چکیده
منابع مشابه
Formulations for Dynamic Lot Sizing with Service Levels
In this paper, we study deterministic dynamic lot-sizing problems with service level constraints on the total number of periods in which backorders can occur over the finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS-SL-I) and study the structure of its solution. We show that an optimal solution to this problem can be found in O(n2κ...
متن کاملEconomic lot-sizing with remanufacturing: complexity and efficient formulations
Within the framework of reverse logistics, the classic economic lot-sizing problem has been extended with a remanufacturing option. In this extended problem, known quantities of used products are returned from customers in each period. These returned products can be remanufactured, so that they are as good as new. Customer demand can then be fulfilled both from newly produced and remanufactured...
متن کاملCapacitated Dynamic Lot Sizing with Capacity Acquisition
One of the fundamental problems in operations management is to determine the optimal investment in capacity. Capacity investment consumes resources and the decision is often irreversible. Moreover, the available capacity level affects the action space for production and inventory planning decisions directly. In this paper, we address the joint capacitated lot sizing and capacity acquisition pro...
متن کاملStrong Formulations for Multi-item Capacitated Lot Sizing*
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems vnth up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generat...
متن کاملNew lot-sizing formulations for less nervous production schedules
Previously scheduled production plans frequently need to be updated because of demand uncertainty. After making a comprehensive de"nition of nervousness which includes costs for changes in production schedule and quantity, we suggest three methodologies. Two methods are modi"ed versions of very well-known methods: the Wagner}Whitin algorithm and the Silver}Meal heuristic. However, our de"nition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics (NRL)
سال: 2013
ISSN: 0894-069X
DOI: 10.1002/nav.21519